package euler.p001_050;

import java.math.BigInteger;

import euler.MainEuler;
import euler.helper.NaturalHelper;

public class Euler016 extends MainEuler {


    /*
        2^15 = 32768 and the sum of its digits is
        3 + 2 + 7 + 6 + 8 = 26.

        What is the sum of the digits of the number 2^1000?

     */
    public String resolve(int power) {

        BigInteger bi = BigInteger.valueOf(2).pow(power);

        return String.valueOf(NaturalHelper.sumaDigital(bi));
    }

}
